Subquery Plan Reuse based Query Optimization
نویسندگان
چکیده
In this paper, we revisit the problem of query optimization in relational DBMS. We propose a scheme to reduce the search space of Dynamic Programming based on reuse of query plans among similar subqueries. The method generates the cover set of similar subgraphs present in the query graph and allows their corresponding subqueries to share query plans among themselves in the search space. Numerous variants to this scheme have been developed for enhanced memory efficiency. Our implementation and experimental study in PostgreSQL show that one of the schemes is better suited to improve the performance of (Iterative) Dynamic Programming.
منابع مشابه
Design of Optimization in Object–Oriented Queries
Query optimization is the process of finding the best or rather a reasonably efficient execution plan, thus by minimizing the time of query evaluation & the cost of evaluation to the level accepted by user. When a query jointly addresses very large and small collections, the iteration caused by query operator is driven by large collection and in each cycle a subquery which depends on an element...
متن کاملQuery Optimization in Oodbms: Identifying Subquery for Complex Query Management
This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address anothe...
متن کاملQuery Optimization in Oodbms: Identifying Subquery for Query Management
This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address anothe...
متن کاملQuery Optimization over Crowdsourced Data
Deco is a comprehensive system for answering declarative queries posed over stored relational data together with data obtained ondemand from the crowd. In this paper we describe Deco’s costbased query optimizer, building on Deco’s data model, query language, and query execution engine presented earlier. Deco’s objective in query optimization is to find the best query plan to answer a query, in ...
متن کاملOptimization of Object-Oriented Queries through Rewriting Compound Weakly Dependent Subqueries
A new static optimization method for object-oriented queries is presented. We deal with a special class of subqueries of a given query called “compound weakly dependent subqueries”. The dependency is considered in the context of SBQL non-algebraic query operators like selection, projection, join, etc. A subquery is weakly dependent from its nearest non-algebraic operator if it depends only on e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011